A Balls - and - Bins Model of Trade ∗
نویسنده
چکیده
A number of stylized facts have been documented about the extensive margin of trade— whether to export or not, and, if so, how many products to how many destinations. We note that some of the reported facts would be expected to arise if exports shipments were randomly allocated across categories (e.g., product codes, destination countries). ey are, thus, not informative of the underlying economic decisions. We formalize the random assignment of shipments to categories as balls falling into bins, reproducing the structure inherent to disaggregate trade data. e balls-and-bins model quantitatively reproduces the prevalence of zero productlevel trade ows across export destinations. e model also accounts for rm-level facts: as in the data, most rms export a single product to a single country but these rms represent a tiny fraction of total exports. In contrast, the balls-and-bins cannot match the small fraction of exporters among U.S. rms and overpredicts their size premium relative to non-exporters. We argue that the balls-and-bins model is a useful statistical tool to discern the interesting facts in disaggregated trade data from patterns arising mechanically through chance.
منابع مشابه
Multiple-Choice Balanced Allocation in (Almost) Parallel
We consider the problem of resource allocation in a parallel environment where new incoming resources are arriving online in groups or batches. We study this scenario in an abstract framework of allocating balls into bins. We revisit the allocation algorithm GREEDY[2] due to Azar, Broder, Karlin, and Upfal (SIAM J. Comput. 1999), in which, for sequentially arriving balls, each ball chooses two ...
متن کاملSymmetric vs. Asymmetric Multiple-Choice Algorithms
Multiple-choice allocation algorithms have been studied intensively over the last decade. These algorithms have several applications in the areas of load balancing, routing, resource allocation and hashing. The underlying idea is simple and can be explained best in the balls-and-bins model: Instead of assigning balls (jobs, requests, or keys) simply at random to bins (machines, servers, or posi...
متن کاملOn Weighted Balls-into-Bins Games
We consider the well-known problem of randomly allocating m balls into n bins. We investigate various properties of single-choice games as well as multiple-choice games in the context of weighted balls. We are particularly interested in questions that are concerned with the distribution of ball weights, and the order in which balls are allocated. Do any of these parameters influence the maximum...
متن کاملA generalized Pólya's urn with graph based interactions
We consider a special case of the generalized Pólya’s urn model introduced in [3]. Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability proportional to its current number of balls. A question of essential inter...
متن کاملA Generalized Pólya’s Urn with Graph Based Interactions: Convergence at Linearity
We consider a special case of the generalized Pólya’s urn model introduced in [3]. Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability proportional to its current number of balls. A question of essential inter...
متن کامل